Mixed-Model U-Shaped Assembly Line Balancing Problems with Coincidence Memetic Algorithm
نویسندگان
چکیده
منابع مشابه
Mixed-Model U-Shaped Assembly Line Balancing Problems with Coincidence Memetic Algorithm
Mixed-model U-shaped assembly line balancing problems (MMUALBP) is known to be NP-hard resulting in it being nearly impossible to obtain an optimal solution for practical problems with deterministic algorithms. This paper presents a new evolutionary method called combinatorial optimisation with coincidence algorithm (COIN) being applied to Type I problems of MMUALBP in a just-in-time production...
متن کامل‘BALANCING AND SEQUENCING’ VERSUS ‘ONLY BALANCING’ IN MIXED MODEL U-LINE ASSEMBLY SYSTEMS: AN ECONOMIC ANALYSIS
With the growth in customers’ demand diversification, mixed-model U-lines (MMUL) have acquired increasing importance in the area of assembly systems. There are generally two different approaches in the literature for balancing such systems. Some researchers believe that since the types of models can be very diverse, a balancing approach without simultaneously sequencing of models will not yield...
متن کاملMixed-Model Assembly Line Balancing with Considering Reliability
This paper presents a multi-objective simulated annealing algorithm for the mixed-model assembly line balancing with stochastic processing times. Since, the stochastic task times may have effects on the bottlenecks of a system, maximizing the weighted line efficiency (equivalent to the minimizing the number of station), minimizing the weighted smoothness index and maximizing the system reliabil...
متن کامل‘balancing and sequencing’ versus ‘only balancing’ in mixed model u-line assembly systems: an economic analysis
with the growth in customers’ demand diversification, mixed-model u-lines (mmul) have acquired increasing importance in the area of assembly systems. there are generally two different approaches in the literature for balancing such systems. some researchers believe that since the types of models can be very diverse, a balancing approach without simultaneously sequencing of models will not yield...
متن کاملAn algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software Engineering and Applications
سال: 2010
ISSN: 1945-3116,1945-3124
DOI: 10.4236/jsea.2010.34040